Parabola-Inscribed Poncelet Polygons Derived from the Bicentric Family
نویسندگان
چکیده
We study loci and properties of a Parabola-inscribed family Poncelet polygons whose caustic is focus-centered circle. This the polar image special case bicentric with respect to its circumcircle. describe closure conditions, curious loci, new conserved quantities.
منابع مشابه
The Pentagram Integrals on Inscribed Polygons
The pentagram map is a completely integrable system defined on the moduli space of polygons. The integrals for the system are certain weighted homogeneous polynomials, which come in pairs: E1, O2, E2, O2, . . . In this paper we prove that Ek = Ok for all k, when these integrals are restricted to the space of polygons which are inscribed in a conic section. Our proof is essentially a combinatori...
متن کاملLargest inscribed rectangles in convex polygons
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an inscribed rectangle with area at least (1− ) times the optimum with probability t in time O( 1 log n) for any constant t < 1. We further give a dete...
متن کاملCurves of constant diameter and inscribed polygons
If one drops the unicity assumption, (C(D)) is the property of having constant diameter, which is in fact equivalent (for closed curves in the plane) to having constant width or constant breadth (for the definitions and the proof of the equivalence, see [8, chap. 25]). It is a surprise to many (including me !) that curves of constant diameter other that the circle do exist. The simplest example...
متن کاملConvergence of the shadow sequence of inscribed polygons
Let P be a polygon inscribed in a circle. The shadow of P is a polygon P ′ whose vertices are at the midpoints of the arcs of consecutive points of P . The shadow sequence P , P , P , . . . is a sequence of inscribed polygons such that each P t is the shadow of P t−1 for all t ≥ 0. We show in this abstract that the shadow sequence converges to the regular polygon, and in such way that variance ...
متن کاملLargest Inscribed Rectangles in Convex Polygons ( Extended Abstract ) ∗
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a deterministic approximation algorithm that computes an inscribed rectangle of area at least 1− times the optimum in running time O( 1 log 1 log n). Furthermore, a randomized approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KoG
سال: 2022
ISSN: ['1846-4068', '1331-1611']
DOI: https://doi.org/10.31896/k.26.1